Performance Comparison between Ant Algorithm and Modified Ant Algorithm
نویسنده
چکیده
This paper gives a brief about two of the metaheuristic techniques that are used to find best among the optimal solutions for complex problems like travelling salesman problem, Quadratic problem. Both of these techniques are based on the natural phenomenon of ant. Ant algorithm find good path but due to some short comings of it, this algorithm is not able to give best out of the good or optimal solutions, but modified ant algorithm which is based on probability finds out the best among the optimal paths We will also see that the modified ant algorithm can obtain less number of hops which helps us to get the best solution to typical problems. Keywords— Ant Algorithm, Modified Ant algorithm, Travelling Salesman Problem, Quadratic problem, Ant System
منابع مشابه
Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملHybrid Improved Dolphin Echolocation and Ant Colony Optimization for Optimal Discrete Sizing of Truss Structures
This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملOptimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملA hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کامل